The 3-fold Vertex via Stable Pairs
نویسنده
چکیده
The theory of stable pairs in the derived category yields an enumerative geometry of curves in 3-folds. We evaluate the equivariant vertex for stable pairs on toric 3-folds in terms of weighted box counting. In the toric Calabi-Yau case, the result simplifies to a new form of pure box counting. The conjectural equivalence with the DT vertex predicts remarkable identities. The equivariant vertex governs primary insertions in the theory of stable pairs for toric varieties. We consider also the descendent vertex and conjecture the complete rationality of the descendent theory for stable pairs.
منابع مشابه
Deciding Graph non-Hamiltonicity via a Closure Algorithm
We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the n! Hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices P, such that pu,i = 1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n + 1. A graph instance (G) is initially coded as exclusion set ...
متن کاملCurve Counting via Stable Pairs in the Derived Category
For a nonsingular projective 3-fold X , we define integer invariants virtually enumerating pairs (C,D) where C ⊂ X is an embedded curve and D ⊂ C is a divisor. A virtual class is constructed on the associated moduli space by viewing a pair as an object in the derived category of X . The resulting invariants are conjecturally equivalent, after universal transformations, to both the Gromov-Witten...
متن کاملBounding cochordal cover number of graphs via vertex stretching
It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...
متن کاملPeripheral Wiener Index of a Graph
The eccentricity of a vertex $v$ is the maximum distance between $v$ and anyother vertex. A vertex with maximum eccentricity is called a peripheral vertex.The peripheral Wiener index $ PW(G)$ of a graph $G$ is defined as the sum ofthe distances between all pairs of peripheral vertices of $G.$ In this paper, weinitiate the study of the peripheral Wiener index and we investigate its basicproperti...
متن کاملTwo-fold automorphisms of graphs
In this paper we shall present a natural generalisation of the notion of automorphism of a graph or digraph G, namely a two-fold automorphism. This is a pair (α, β) of permutations of the vertex set V(G) which acts on ordered pairs of vertices of G in the natural way. The action of (α, β) on all such ordered pairs gives a graph which is two-fold isomorphic to G. When α = β the two-fold automorp...
متن کامل